Cut-Elimination for Simple Type Theory with An Axiom of Choice
نویسنده
چکیده
We present a cut-elimination proof for simple type theory with axiom of choice modeled after Takahashi’s proof of cut-elimination for simple type theory with extensionality. The same proof works when types are restricted, for example for second-order classsical logic with axiom of choice.
منابع مشابه
Proof Normalization Modulo
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theories having a so-called pre-model. As a corollary, we retrieve cut elimination for several axiomatic theories, including Church’s simple type theory. Deduction modulo [11] is a formulation of first-order logic, that g...
متن کاملArithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the structure of cut free proofs is the key to many results about predicate logic with no axioms: analyticity and non-provability results, completeness results for proof search algorithms, decidability results for fragments...
متن کاملOn Tychonoff's type theorem via grills
Let ${X_{alpha}:alphainLambda}$ be a collection of topological spaces, and $mathcal {G}_{alpha}$ be a grill on $X_{alpha}$ for each $alphainLambda$. We consider Tychonoffrq{}s type Theorem for $X=prod_{alphainLambda}X_{alpha}$ via the above grills and a natural grill on $X$ related to these grills, and present a simple proof to this theorem. This immediately yields the classical theorem...
متن کاملSimple Type Theory as a Clausal Theory
Deduction modulo is an extension of first-order predicate logic where axioms are replaced by rewrite rules. For instance, the axiom P ⇔ (Q ⇒ R) is replaced by the rule P −→ (Q ⇒ R). These rules define an equivalence relation and, in a proof, a proposition can be replaced by an equivalent one at any time. A presentation of Simple Type Theory in Deduction modulo, calledHOL, has been given in [3]....
متن کاملCut elimination for Zermelo set theory
We show how to express intuitionistic Zermelo set theory in deduction modulo (i.e. by replacing its axioms by rewrite rules) in such a way that the corresponding notion of proof enjoys the normalization property. To do so, we first rephrase set theory as a theory of pointed graphs (following a paradigm due to P. Aczel) by interpreting set-theoretic equality as bisimilarity, and show that in thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 64 شماره
صفحات -
تاریخ انتشار 1999